Wireless Communication

M. Viju Prakash ¹, B. Paramasivan ², S. Jeya Shobana ³

Affiliations
1 Department of Computer Science and Engineering from Manonmaniam Sundaranar University, Tirunelveli, IN
2 Anna University, Chennai, IN
3 Department of Computer Science and Engineering from Manonmanium Sundaranar University, Tirunelveli, IN

Abstract

A Wireless Sensor Network (WSN) is a spatially distributed wireless network with autonomous devices. Each sensor node is having the capability to communicate the information with each other directly or indirectly. Due to the desirable scalability and efficiency in the WSN, the packets should be routed to the destination efficiently with limited power usage. The nodes in the WSN are highly mobile and based on the dynamic scenarios in the routing path, the network topology change frequently. A node in the routing path should aware about the information regarding the nearest node. In traditional routing protocols, every node in the network exchanges periodic one-hop beacons. Beacons are short messages send periodically to indicate the neighbor nodes about their identification and position in the network. In real scenarios due to the dynamic and error-prone nature of wireless links these beacons can create several problems in the network. Due to node mobility, maintaining the neighbor information of the nodes in the network for the routing protocol is difficult. To overcome this, beaconless routing such as Energy-efficient Beaconless Geographic Routing (EBGR), Contention-Based Forwarding (CBF), Guaranteed Delivery Beaconless Forwarding (GDBF), Implicit Geographic Forwarding (IGF), Geographic Random Forwarding (GeRaF), Beacon-Less Routing (BLR) and Beacon-less Protocol (BOSS) are used. In this paper performance has been analyzed for the above said beaconless routing protocols and metrics are packet delivery ratio and latency with the beaconless routing protocols. Results are shows that EBGR and BOSS significantly outperform the other beaconless routing protocols with dynamic network topologies.

Keywords

Beacons, Beacon-Less Routing, Beacon-Less Protocol, Contention-Based Forwarding, Energy-Efficient Beaconless Geographic Routing, Geographic Random Forwarding, Guaranteed Delivery Beaconless Forwarding, Implicit Geographic Forwarding.

Full Text

     

S. Jeya Shobana ¹, B. Paramasivan ², M. Viju Prakash ¹

Affiliations
1 Department of Computer Science and Engineering from Manonmaniam Sundaranar University, Tirunelveli, IN
2 Anna University, Chennai, IN

Abstract

Congestion is detrimental to Wireless sensor network (WSN) and it causes excessive energy consumption and packet drop. The event driven nature of WSN leads to a network load that cannot be predicted. As an outcome, congestion may transpire at sensors that obtain additional data than they can forward, which causes energy fritter, throughput diminution and packet loss. Every protocol possesses its own individuality and desires in terms of bandwidth, packet thrash, efficiency and sustainability of traffic. Still, attaining the desired throughput is a non trivial task as congestion is sure to come in a sensor network. Here it matters which protocol serves best to overcome congestion. In this paper, we weigh against the performance of various congestion control algorithms like FCCP, PCCP, PHTCCP and ACT. Under the simulations and study, the rate based FCCP provides better performance than the other existing approaches that alleviates throughput, packet loss, energy efficiency and fairness.

Keywords

Adaptive Compression Based Congestion Control Technique (ACT), Congestion Control, Fairness Aware Congestion Control Protocol (FCCP), Priority-Based Congestion Control Protocol (PCCP), Prioritized Heterogeneous Traffic Oriented Congestion Control Protocol.

Full Text